New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set
نویسندگان
چکیده
منابع مشابه
On Approximability of the Independent/Connected Edge Dominating Set Problems
We investigate polynomial-time approximability of the problems related to edge dominating sets of graphs. When edges are unit-weighted, the edge dominating set problem is polynomially equivalent to the minimum maximal matching problem, in either exact or approximate computation, and the former problem was recently found to be approximable within a factor of 2 even with arbitrary weights. It wil...
متن کاملApproximability of the capacitated b-edge dominating set problem
In this paper, we discuss the approximability of the capacitated b-edge dominating set problem, which generalizes the edge dominating set problem by introducing capacities and demands on the edges. We present an approximation algorithm for this problem and show that it achieves a factor of 8/3 for general graphs and a factor of 2 for bipartite graphs. Moreover, we discuss the relationships of t...
متن کاملOn the complexity of fixed parameter clique and dominating set
We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection.
متن کاملNew parameterized algorithms for edge dominating set
An edge dominating set of a graph G = (V,E) is a subset M ⊆ E of edges in the graph such that each edge in E −M is incident with at least one edge in M . In an instance of the parameterized edge dominating set problem we are given a graph G = (V,E) and an integer k and we are asked to decide whether G has an edge dominating set of size at most k. In this paper we show that the parameterized edg...
متن کاملFixed parameter approximability and inapproximability
NP -hard problems are believed to be intractable. This is the widely believe assumption that P 6= NP . In parameterized complexity the input is refined to (I, k) with k a parameter depending on the input and the goal is to find an exact algorithm that runs in time f(k) ·nO(1) for the problem so that f is an arbitrary function. In this draft we only focus on k that is the size of the optimum sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2014
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-014-9549-5